Research on Parallel Real-time Scheduling Algorithm of Hybrid Parameter Tasks on Multi-core Platform
نویسندگان
چکیده
Nowadays, multi-core processors are becoming main stream in computer market due to their high performance, low cost and less power consumption characteristics. However, multi-core processors give rise to new problems when they are applied to real-time system. Little attention has been focused on tasks' DMR(deadline miss rate) by using previous multi-core real time scheduling algorithms under the overload condition. As a result, the domino effect will happen because of many tasks failing to meet their deadlines. Meanwhile, the system performance is leaded to drop sharply. In order to alleviate this problem, this paper proposes a new multi-core real time scheduling algorithm which extends the Pfair scheduling method using tasks' hybrid parameters. In addition, the paper will also discuss the tasks’ allocation method which would decrease the switch cost. Experimental results for schedules demonstrate that our scheme enables the real time tasks to be scheduled more efficiently on multi-core platform by adopting hybrid parameter priority. Furthermore, the system performance has gained the robust characteristic, because more real time tasks can meet their deadline under the overload condition.
منابع مشابه
A New Hybrid Meta-Heuristics Approach to Solve the Parallel Machine Scheduling Problem Considering Human Resiliency Engineering
This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کاملA Hybrid Real-Time Scheduling Approach on Multi-Core Architectures
This paper proposes a hybrid scheduling approach for real-time system on homogeneous multi-core architecture. To make the best of the available parallelism in these systems, first an application is partitioned into some parallel tasks as much as possible. Then the parallel tasks are dispatched to different cores, so as to execute in parallel. In each core, real-time tasks can run concurrently w...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کامل